Partial hyperplane activation for generalized intersection cuts
نویسندگان
چکیده
The generalized intersection cut (GIC) paradigm is a recent framework for generating cutting planes in mixed integer programming with attractive theoretical properties. We investigate this computationally unexplored paradigm and observe that a key hyperplane activation procedure embedded in it is not computationally viable. To overcome this issue, we develop a novel replacement to this procedure called partial hyperplane activation (PHA), introduce a variant of PHA based on a notion of hyperplane tilting, and prove the validity of both algorithms. We propose several implementation strategies and parameter choices for our PHA algorithms and provide supporting theoretical results. We computationally evaluate these ideas in the COIN-OR framework ∗[email protected]
منابع مشابه
The Stopped Simplex Algorithm for Integer Linear Programs with Special Cuts
This paper presents an improved stopped simplex algorithm that aims to further decrease the stopped number of the variables. First of all, two special cuts are generated by introducing a linear transformation to cut the intersection of the objective function hyperplane and the feasible region of the linear programming relaxation problem. So, the cuts lead to the more narrow intervals of the var...
متن کاملGeneralized Ham-Sandwich Cuts
Bárány, Hubard, and Jerónimo recently showed that for given wellseparated convex bodies S1, . . . , Sd in R and constants βi ∈ [0,1], there exists a unique hyperplane h with the property that Vol(h+ ∩ Si) = βi · Vol(Si); h+ is the closed positive transversal halfspace of h, and h is a “generalized ham-sandwich cut.” We give a discrete analogue for a set S of n points in R which are partitioned ...
متن کاملGeneralized intersection cuts and a new cut generating paradigm
Intersection cuts are generated from a polyhedral cone and a convex set S whose interior contains no feasible integer point. We generalize these cuts by replacing the cone with a more general polyhedron C. The resulting generalized intersection cuts dominate the original ones. This leads to a new cutting plane paradigm under which one generates and stores the intersection points of the extreme ...
متن کاملGeneralized Ham-Sandwich Cuts for Well Separated Point Sets
Bárány, Hubard, and Jerónimo recently showed that for given well separated convex bodies S1, . . . , Sd in R and constants βi ∈ [0, 1], there exists a unique hyperplane h with the property that Vol(h ∩Si) = βi·Vol(Si); h is the closed positive transversal halfspace of h, and h is a “generalized ham-sandwich cut”. We give a discrete analogue for a set S of n points in R which is partitioned into...
متن کاملIntersection Cuts with Infinite Split Rank
We consider mixed integer linear programs where free integer variables are expressed in terms of nonnegative continuous variables. When this model only has two integer variables, Dey and Louveaux characterized the intersection cuts that have infinite split rank. We show that, for any number of integer variables, the split rank of an intersection cut generated from a rational lattice-free polyto...
متن کامل